An artificial immune system algorithm for solving the uncapacitated single allocation p-Hub median problem
نویسندگان
چکیده
The present paper deals with a variant of hub location problems (HLP): the uncapacitated single allocation p-Hub median problem (USApHMP). This consists to jointly locate facilities and allocate demand nodes these selected facilities. objective function is minimize routing demands between any origin destination pair nodes. known be NP-hard. Based on artificial immune systems (AIS) framework, this develops new approach efficiently solve USApHMP. proposed in form clonal selection algorithm (CSA) that uses appropriate encoding schemes solutions maintains their feasibility. Comprehensive experiments comparison other existing heuristics are conducted benchmark from civil aeronautics board, Australian post, PlanetLab Urand data sets. results obtained allow demonstrate validity effectiveness our approach. In terms solution quality, outperform best-known literature.
منابع مشابه
Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU
A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation p-Hub Median problem. The GA uses binary and integer encoding and genetic operators adapted to this problem. Our GA is improved by generated initial solution with hubs located at middle nodes. The obtained experimental results are compared with the best known solutions on all b...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملScatter search for an uncapacitated p-hub median problem
Scatter search is a population-based method that has been shown to yield high-quality outcomes for combinatorial optimization problems. It uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we present a scatter search implementation for an NP-hard variant of the classic p-hub median problem. Specifically, we tackle the unca...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function
In this paper, we address a new version of the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) in which transportation costs on each edge are given by piecewise constant cost functions. In the classical USApHMP, transportation costs are modelled as linear functions of the transport volume, where a fixed discount factor on hubhub connections is introduced to simulate economies of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering
سال: 2021
ISSN: ['2088-8708']
DOI: https://doi.org/10.11591/ijece.v11i3.pp2293-2306